A robust capacitated lot sizing problem with setup times and overtime decisions with backordering allowed under demand uncertainty

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Capacitated Lot Sizing Problem with Stochastic Setup Times

In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...

متن کامل

Capacitated Lot-sizing Problem with Setup Times, Stock and Demand Shortages

We address a multi-item capacitated lot-sizing problem with setup times, stock and demand shortages. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. In this paper we consider an approach based on a lagrangean relaxation of the capacity constraints to generate a lower bound of the optimal va...

متن کامل

Multi-Item Capacitated Lot-Sizing Problems with Setup Times and Pricing Decisions

We study a multi-item capacitated lot-sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set price...

متن کامل

An Efficient Heuristic Algorithm for Capacitated Lot Sizing Problem with Overtime Decisions

Capacitated Lot Sizing Problem is a very important tactical level decision making problem that answers the questions of producing when and how many in dynamic demand environment. Solving Capacitated Lot Sizing Problem with Overtime decisions (CLSPO) and extensions derived from the fundamental structure optimally suffer from combinatorial nature of the problem. The aim of the study is to form a ...

متن کامل

A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times

We introduce Horizon Decomposition in the context of Dantzig-Wolfe Decomposition, and apply it to the Capacitated Lot-Sizing Problem with Setup Times. We partition the problem horizon in contiguous overlapping intervals and create subproblems identical to the original problem, but of smaller size. The user has the flexibility to regulate the size of the master problem and the subproblem via two...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2019

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2019.11.223